Subtour elimination constraints imply a matrix-tree theorem SDP constraint for the TSP
نویسندگان
چکیده
منابع مشابه
Generating subtour elimination constraints for the TSP from pure integer solutions
The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems. Given a complete graph [Formula: see text] and non-negative distances d for every edge, the TSP asks for a shortest tour through all vertices with respect to the distances d. The method of choice for solving the TSP to optimality is a branch and cut approach. Usually the integrality constraint...
متن کاملGenerating subtour constraints for the TSP from pure integer solutions
The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems. Given a complete graph G = (V, E) and non-negative distances d for every edge, the TSP asks for a shortest tour through all vertices with respect to the distances d. The method of choice for solving the TSP to optimality is a branch-and-bound-and-cut approach. Usually the integrality constrain...
متن کاملNew Subtour-Based Crossover Operator for the TSP
Genetic algorithm (GA) is a very useful method for the global search of large search space and has been applied to various problems. It has two kinds of important search mechanisms, crossover and mutation. Because the performance of GA depends on these operators, a large number of operators have been developed for improving the performance of GA. Especially many researchers have more interested...
متن کاملAround Matrix-tree Theorem
Generalizing the classical matrix-tree theorem we provide a formula counting subgraphs of a given graph with a fixed 2-core. We use this generalization to obtain an analog of the matrix-tree theorem for the root system Dn (the classical theorem corresponds to the An-case). Several byproducts of the developed technique, such as a new formula for a specialization of the multivariate Tutte polynom...
متن کاملA note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem
Corrected Miller–Tucker–Zemlin type subtour elimination constraints for the capacitated vehicle routing problem are presented. 2003 Elsevier B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2020
ISSN: 0167-6377
DOI: 10.1016/j.orl.2020.02.011